Back to course home
0% completed
Vote For New Content
Introduction
Course Overview
Basics of Tree
Introduction to Tree
Types of Tree
BST Traversal Techniques
BST Operations
Level Order Traversal Pattern (easy)
Introduction to Level Order Traversal Pattern
Reverse Level Order Traversal (easy)
Solution: Reverse Level Order Traversal
Find Largest Value in Each Tree Row (medium)
Solution: Find Largest Value in Each Tree Row
Maximum Width of Binary Tree (medium)
Solution: Maximum Width of Binary Tree
Maximum Level Sum of a Binary Tree (medium)
Solution: Maximum Level Sum of a Binary Tree
Zigzag Traversal (medium)
Solution: Zigzag Traversal
Even Odd Tree (medium)
Solution: Even Odd Tree
N-ary Tree Level Order Traversal (hard)
Solution: N-ary Tree Level Order Traversal
Tree Depth Pattern (easy)
Introduction to Tree Depth Pattern
Maximum Depth (or Height) of Binary Tree (easy)
Solution: Maximum Depth (or Height) of Binary Tree
Minimum Depth of a Binary Tree (easy)
Solution: Minimum Depth of a Binary Tree
Balanced Binary Tree (easy)
Solution: Balanced Binary Tree
Tree Diameter (easy)
Solution: Tree Diameter
Maximum Depth of N-ary Tree (easy)
Solution: Maximum Depth of N-ary Tree
Find maximum depth of subtree (medium)
Solution: Find maximum depth of subtree
Serialize and Deserialize Tree Pattern (hard)
Introduction to Serialize and Deserialize Tree Pattern
Serialize and Deserialize BST (medium)
Solution: Serialize and Deserialize BST
Verify Preorder Serialization of a Binary Tree (medium)
Solution: Verify Preorder Serialization of a Binary Tree
Create Binary Tree From Descriptions (medium)
Solution: Create Binary Tree From Descriptions
Serialize and Deserialize N-ary Tree (hard)
Solution: Serialize and Deserialize N-ary Tree
Isomorphic Trees (medium)
Problem Statement
Given root of two binary trees root1 and root2, return true if they are isomorphic. Otherwise, return false.
Two trees are said to be isomorphic if one tree can be transformed into the other by swapping the left and right children of some nodes.
Note that the structure should be identical after possible swaps, and the values of nodes must be the same in both trees.
Examples
Example 1
- Input: root1 =
[1, 2, 3, 4], root2 =[1, 3, 2, null, null, 4]
- Output:
true - Explanation: In the first tree, we can swap 2 with 3, and 4 with null to get the second tree by swapping.
Example 2
- Input: root1 =
[1, 2, 3], root2 =[1, 3, 2]
- Output:
true - Explanation: We can swap the left and right children of the root node in Tree 1. This transforms Tree 1 into Tree 2.
Example 3
- Input: root1 =
[1, 2, 3, 4, 5, 6, 7], root2 =[1, 4, 3, 2, 5, 7, 6]
- Output:
false - Explanation: We can't get tree2 by performing swap operations in tree1.
Try it yourself
Try solving this question here:
Java
Saved to Cloud
. . . .
Solution: Subtree of Another Tree
Solution: Isomorphic Trees
Mark as Completed
On this page
Problem Statement
Examples
Try it yourself